A kernel vector quantization codebook designing for image compression based on simulated annealing into genetic algorithm
نویسندگان
چکیده
To solve premature phenomenon and falling into local optimum of genetic algorithm, the simulated annealing algorithm is introduced to the genetic algorithm and a simulated annealing is presented based on genetic clustering algorithm, a new effective SA, crossover operator and mutation operator proposed for fitting the partition-based chromosome coding. In addition, the Euclidean distance is replaced by the kernel function distance to improve the performance of the proposed algorithm further. We also applied the proposed algorithm to image compression. Experimental results indicate its superiority in terms of peak signal to noise ratio (PSNR).
منابع مشابه
Iteration Free Fractal Image Compression For Color Images Using Vector Quantization, Genetic Algorithm And Simulated Annealing
This research paper on iteration free fractal image compression for color images using the techniques Vector Quantization, Genetic Algorithm and Simulated Annealing is proposed, for lossy compression, to improve the decoded image quality, compression ratio and reduction in coding time. Fractal coding consists of the representation of image blocks through the contractive transformation coefficie...
متن کاملGenetic Algorithms for Codebook Generation in Vector Quantization
In the present paper we study genetic algorithms for the codebook generation problem of vector quantization. There are two different approaches to the problem: a codebook-based and a partition-based. Both these approaches can be derived from the optimality criteria of GLA. From these, the codebookbased approach is clearly superior to the partition-based approach. The experiments show that a pur...
متن کاملA Fast Evolutionary Algorithm in Codebook Design
This paper presents a fast algorithm to find an optimal subset codebook from a super codebook in a way that the RMS error between the new codebook and the training set in vector quantization becomes minimum. To have a fast algorithm, a genetic based algorithm is used that uses 2 evolutions, one in designing the whole sub-codebook and the other in finding each individual codeword of the sub-code...
متن کاملCompetitive learning algorithms for robust vector quantization
|The e cient representation and encoding of signals with limited resources, e.g., nite storage capacity and restricted transmission bandwidth, is a fundamental problem in technical as well as biological information processing systems. Typically, under realistic circumstances, the encoding and communication of messages has to deal with different sources of noise and disturbances. In this paper, ...
متن کاملA new two-step learning vector quantization algorithm for image compression
The learning vector quantization (LVQ) algorithm is widely used in image compression because of its intuitively clear learning process and simple implementation. However, LVQ strongly depends on the initialization of the codebook and often converges to local optimal results. To address the issues, a new two-step LVQ (TsLVQ) algorithm is proposed in the paper. TsLVQ uses a correcting learning st...
متن کامل